An Alternative Proof of The Schwartz-Zippel Lemma
نویسنده
چکیده
We show an alternative proof of the Schwartz-Zippel lemma. The lemma bounds the number of zeros of a multivariate low degree polynomial over a finite field.
منابع مشابه
A Note on "Zippel Denesting"
Radical simpliication is an important part of symbolic computation systems. Zippel 7] gave a suucient condition for a nested radical to be expressed in terms of radicals of lower nesting depth. We ll a lacuna in his proof, and show that his suucient condition is also necessary. Previous work by Landau and Miller 4] leads to an algorithm for the problem.
متن کاملA note on circuit lower bounds from derandomization
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales better, and yields a somewhat stronger result than the original argument.
متن کاملAn argument for Hamiltonicity
A constant-round interactive argument is introduced to show existence of a Hamiltonian cycle in a directed graph. Graph is represented with a characteristic polynomial, top coefficient of a verification polynomial is tested to fit the cycle, soundness follows from Schwartz-Zippel lemma.
متن کامل4.1 Primality Testing Continued
The obvious approach for designing an algorithm around this fact is to use the Schwartz-Zippel test to see if (x − a) − (x − a) is the zero polynomial. However, this fails for two reasons. The first is that if n is not prime then Zn is not a field (which we assumed in our analysis of Schwartz-Zippel); the second is that the degree of the polynomial is n, which is the same as the cardinality of ...
متن کاملThe Isomorphismproblem for One-Time-Only Branching Programs
We investigate the computational complexity of the isomorphism problem for one-time-only branching programs (BP1-Iso): on input of two one-time-only branching programs B 0 and B 1 , decide whether there exists a permutation of the variables of B 1 such that it becomes equivalent to B 0. Our main result is a two-round interactive proof for BP1-Iso, the complement of BP1-Iso. The protocol is base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 17 شماره
صفحات -
تاریخ انتشار 2010